Binary search tree

Results: 306



#Item
91On the complexity of searching for an evader with a faster pursuer Florian Shkurti1 and Gregory Dudek1 Abstract— In this paper we examine pursuit-evasion games in which the pursuer has higher speed than the evader. Thi

On the complexity of searching for an evader with a faster pursuer Florian Shkurti1 and Gregory Dudek1 Abstract— In this paper we examine pursuit-evasion games in which the pursuer has higher speed than the evader. Thi

Add to Reading List

Source URL: www.cim.mcgill.ca

Language: English - Date: 2013-05-18 17:31:04
92Dynamic Pipelining: Making IP-Lookup Truly Scalable Jahangir Hasan T. N. Vijaykumar  {hasanj, vijay} @ecn.purdue.edu

Dynamic Pipelining: Making IP-Lookup Truly Scalable Jahangir Hasan T. N. Vijaykumar {hasanj, vijay} @ecn.purdue.edu

Add to Reading List

Source URL: conferences.sigcomm.org

Language: English - Date: 2005-07-14 13:20:18
93FastAD: An Authenticated Directory for Billions of Objects Paul T. Stanton, Benjamin McKeown, Randal Burns, Giuseppe Ateniese Department of Computer Science, Johns Hopkins University ABSTRACT We develop techniques that m

FastAD: An Authenticated Directory for Billions of Objects Paul T. Stanton, Benjamin McKeown, Randal Burns, Giuseppe Ateniese Department of Computer Science, Johns Hopkins University ABSTRACT We develop techniques that m

Add to Reading List

Source URL: www.sigops.org

Language: English - Date: 2009-09-28 22:39:23
94A Case Study in Building Layered DHT Applications Yatin Chawathe† Sriram Ramabhadran∗  Sylvia Ratnasamy‡

A Case Study in Building Layered DHT Applications Yatin Chawathe† Sriram Ramabhadran∗ Sylvia Ratnasamy‡

Add to Reading List

Source URL: conferences.sigcomm.org

Language: English - Date: 2005-06-20 15:46:58
95Lecture 18: Tree Traversals PIC 10B Todd Wittman  Tree Traversals

Lecture 18: Tree Traversals PIC 10B Todd Wittman Tree Traversals

Add to Reading List

Source URL: www.math.ucla.edu

Language: English - Date: 2010-02-22 19:24:36
96M ASTER’ S T HESIS  String Indexing for Patterns with Wildcards Hjalte Wedel Vildhøj and Søren Vind Technical University of Denmark August 8, 2011

M ASTER’ S T HESIS String Indexing for Patterns with Wildcards Hjalte Wedel Vildhøj and Søren Vind Technical University of Denmark August 8, 2011

Add to Reading List

Source URL: www2.imm.dtu.dk

Language: English - Date: 2012-10-17 04:44:56
97Data Structures and Algorithm Analysis Edition 3.2 (C++ Version) Clifford A. Shaffer Department of Computer Science Virginia Tech

Data Structures and Algorithm Analysis Edition 3.2 (C++ Version) Clifford A. Shaffer Department of Computer Science Virginia Tech

Add to Reading List

Source URL: people.cs.vt.edu

Language: English - Date: 2012-01-02 10:08:45
98CP SC: Computational Geometry  Feb 6, 2007 Lecture 8: 1D/2D Range Searching, Kd trees Lecturer: Suresh Venkatasubramanian

CP SC: Computational Geometry Feb 6, 2007 Lecture 8: 1D/2D Range Searching, Kd trees Lecturer: Suresh Venkatasubramanian

Add to Reading List

Source URL: www.cs.utah.edu

Language: English - Date: 2009-01-13 17:36:19
99The Cost of Fault Tolerance in Multi-Party Communication Complexity∗ Haifeng Yu National University of Singapore Singapore

The Cost of Fault Tolerance in Multi-Party Communication Complexity∗ Haifeng Yu National University of Singapore Singapore

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2012-05-17 05:45:49
100C:/Users/scheng/Documents/research/uncertain/paper.dvi

C:/Users/scheng/Documents/research/uncertain/paper.dvi

Add to Reading List

Source URL: www.cse.ust.hk

Language: English - Date: 2012-06-18 04:21:45